Error Localization of Complex DFT Codes Using Propagator Method
نویسندگان
چکیده
In this paper we consider the problem of error localization of complex DFT codes and the reconstruction of message. A propagator-based subspace algorithm is proposed for error localization of quantized DFT codes. The propagator method requires only linear operations and does not require any eigendecomposition of syndrome covariance matrix as in conventional subspace method such as MUSIC etc. The performance of the proposed method is compared with MUSIC algorithm. Simulation results show that the proposed method performs equal to the MUSIC algorithm with less computational complexity.
منابع مشابه
راهکار جدید استخراج ویژگی مبتنی بر نمونهبرداری فشرده در پردازش سیگنالهای صوتی
In this paper, we present a Compressive Sampling (CS)-based feature extraction method for audio signals. In the proposed approach, the audio signal is firstly segmented by hamming windows and the Discrete Fourier Transform (DFT) of the samples is calculated within each frame. Then, the normalized values of the DFT coefficients of each frame are accumulated. At the next step, the second DFT is a...
متن کاملEnhancing error localization of DFT codes by weighted ℓ1-norm minimization
We consider the problem of decoding of real BCH discrete Fourier transform codes (RDFT) which are considered for joint source channel codes to provide robustness against errors in communication channels. In this paper, we propose to combine the subspace based algorithm like MUSIC algorithm with `1-norm minimization algorithm, which is promoted as a sparsity solution functional, to enhance the e...
متن کاملMap-merging in Multi-robot Simultaneous Localization and Mapping Process Using Two Heterogeneous Ground Robots
In this article, a fast and reliable map-merging algorithm is proposed to produce a global two dimensional map of an indoor environment in a multi-robot simultaneous localization and mapping (SLAM) process. In SLAM process, to find its way in this environment, a robot should be able to determine its position relative to a map formed from its observations. To solve this complex problem, simultan...
متن کاملAn approach to fault detection and correction in design of systems using of Turbo codes
We present an approach to design of fault tolerant computing systems. In this paper, a technique is employed that enable the combination of several codes, in order to obtain flexibility in the design of error correcting codes. Code combining techniques are very effective, which one of these codes are turbo codes. The Algorithm-based fault tolerance techniques that to detect errors rely on the c...
متن کاملDistributed Lossy Source Coding Using BCH-DFT Codes
Distributed source coding, separate encoding (compression) and joint decoding of statistically dependent sources, arises in an increasing number of applications like sensor networks and multiview video coding. Many of those applications are highly interactive, requiring the development of low-delay, energy-limited communication and computing schemes. Currently, this compression is performed by ...
متن کامل